Dense Packing of Patterns in a Permutation
نویسندگان
چکیده
We study the length Lk of the shortest permutation containing all patterns of length k. We establish the bounds e−2k2 < Lk ≤ (2/3 + o(1))k2 . We also prove that as k → ∞, there are permutations of length (1/4+o(1))k2 containing almost all patterns of length k.
منابع مشابه
Counting Fixed-Length Permutation Patterns
We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we obtain exact values for the expectation and variance for the number of large patterns in a random permutation. Finally, we are able to generalize the idea of bon...
متن کاملNote on Packing Patterns in Colored Permutations
Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently the packing density for all but two (up to equivalence) patterns up to...
متن کاملAn Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.
متن کاملAN EXPERIMENTAL INVESTIGATION ON IMPROVING THE MEDIUM AND LATE-AGE COMPRESSIVE STRENGTHS OF CLASS G OIL WELL CEMENT
In this study, the effects of particle size distribution improvement and dense packing techniques on the 28- and 90-day compressive strengths of class G oil well cement have been investigated. It was observed that limited improvements in the particle size distribution of cement (regarding industrial possibilities) cannot result in a significant increase in 28- and 90-day compressive strengths. ...
متن کاملPacking sets of patterns
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question has been tangentially considered previously, this is the first systematic study of it. We find the packing density for various special sets of permut...
متن کامل